Distance-dcovering problems in scale-free networks with degree correlations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance-d covering problems in scale-free networks with degree correlations.

A number of problems in communication systems demand the distributed allocation of network resources in order to provide better services, sampling, and distribution methods. The solution to these issues is becoming more challenging due to the increasing size and complexity of communication networks. We report here on a heuristic method to find near-optimal solutions to the covering problem in r...

متن کامل

Degree Correlations in Directed Scale-Free Networks

Scale-free networks, in which the distribution of the degrees obeys a power-law, are ubiquitous in the study of complex systems. One basic network property that relates to the structure of the links found is the degree assortativity, which is a measure of the correlation between the degrees of the nodes at the end of the links. Degree correlations are known to affect both the structure of a net...

متن کامل

Intrinsic degree-correlations in static scale-free networks

We calculate the mean neighboring degree function k̄nn(k) and the mean clustering function C(k) of vertices with degree k as a function of k in finite scale-free random networks through the static model. While both are independent of k when the degree exponent γ ≥ 3, they show the crossover behavior for 2 < γ < 3 from k-independent behavior for small k to k-dependent behavior for large k. The k-...

متن کامل

Fractality and degree correlations in scale-free networks

Fractal scale-free networks are empirically known to exhibit disassortative degree mixing. It is, however, not obvious whether a negative degree correlation between nearest neighbor nodes makes a scale-free network fractal. Here we examine the possibility that disassortativity in complex networks is the origin of fractality. To this end, maximally disassortative (MD) networks are prepared by re...

متن کامل

Synchronization in weighted scale free networks with degree-degree correlation

We study synchronization phenomena in scale-free networks of asymmetrically coupled dynamical systems featuring degree-degree correlation in the topology of the connection wiring. We show that when the interaction is dominant from the high-degree to the low-degree (from the low-degree to the high degree) nodes, synchronization is enhanced for assortative (disassortative) degree-degree correlati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2005

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.71.035102